A $q$-Robinson-Schensted-Knuth Algorithm and a $q$-Polymer
نویسندگان
چکیده
منابع مشابه
A $q$-Robinson-Schensted-Knuth Algorithm and a $q$-Polymer
In Matveev-Petrov (2017) a q-deformed Robinson-Schensted-Knuth algorithm (qRSK) was introduced. In this article we give reformulations of this algorithm in terms of the Noumi-Yamada description, growth diagrams and local moves. We show that the algorithm is symmetric, namely the output tableaux pairs are swapped in a sense of distribution when the input matrix is transposed. We also formulate a...
متن کاملA q-weighted version of the Robinson-Schensted algorithm
We introduce a q-weighted version of the Robinson-Schensted (column insertion) algorithm which is closely connected to q-Whittaker functions (or Macdonald polynomials with t = 0) and reduces to the usual Robinson-Schensted algorithm when q = 0. The q-insertion algorithm is ‘randomised’, or ‘quantum’, in the sense that when inserting a positive integer into a tableau, the output is a distributio...
متن کاملOscillating Tableaux , S p × S q - modules , and Robinson - Schensted - Knuth correspondence
The Robinson-Schensted-Knuth correspondence (RSK, see [8] and Corollary 2.5 below) is a bijection between pairs of semi-standard Young tableaux of the same shape and matrices with nonnegative integer entries with prescribed column and row sums. This correspondence plays an important role in the representation theory of the symmetric group and general linear groups, and in the theory of symmetri...
متن کاملFactorization of the Robinson-Schensted-Knuth correspondence
In [4], a bijection between collections of reduced factorizations of elements of the symmetric group was described. Initially, this bijection was used to show the Schur positivity of the Stanley symmetric functions. Further investigations have revealed that our bijection has strong connections to other more familiar combinatorial algorithms. In this paper we will show how the Robinson-Schensted...
متن کاملProperties of the nonsymmetric Robinson-Schensted-Knuth algorithm
We introduce a generalization of the Robinson-Schensted-Knuth algorithm to composition tableaux involving an arbitrary permutation. If the permutation is the identity our construction reduces to Mason’s original composition Robinson-Schensted-Knuth algorithm. In particular we develop an analogue of Schensted insertion in our more general setting, and use this to obtain new decompositions of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6739